Space-efficient parallel merging
نویسندگان
چکیده
منابع مشابه
Parallel Three-sequence Alignment with Space-efficient
The sequence alignment is a fundamental problem in computational biology. Many sequence alignment methods have been proposed, such as pair-wise sequence alignment, multiple sequence alignment (MSA), syntenic alignment, constraint multiple sequence alignment, and etc. Among them, pair-wise sequence alignment is a most commonly used method. Recently, MSA is more and more important which has been ...
متن کاملSpace Efficient Algorithms for Series-Parallel Graphs
The subclass of directed series-parallel graphs plays an important role in computer science. To determine whether a graph is series-parallel is a well studied problem in algorithmic graph theory. Fast sequential and parallel algorithms for this problem have been developed in a sequence of papers. For series-parallel graphs methods are also known to solve the reachability and the decomposition p...
متن کاملSimplified, stable parallel merging
This note makes an observation that significantly simplifies previous parallel, two-way merge algorithms based on binary search and sequential merge in parallel. First, it is shown that the additional merge step of distinguished elements as found in previous algorithms is not necessary , thus simplifying the implementation and reducing constant factors. Second, by fixating the requirements to t...
متن کاملProvably Efficient Stream Merging
We investigate the stream merging problem for mediaon-demand servers. Clients requesting media from the server arrive by a Poisson process, and delivery to the clients starts immediately. Clients are prepared to receive up to two streams at any time, one or both being fed into a bu er cache. A multicast mechanism exists that allows multiple clients to receive the same stream. We present an on-l...
متن کاملImproved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numerical robustness and O(n) output sensitive time complexity, while simultaneously admitting a straightforward implementation. To achieve these properties, we present two key algorithmic improvements. The first is a method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1993
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1993270402951